A Node-Charge Graph-Based Online Carshare Rebalancing Policy with Capacitated Electric Charging

Viability of electric car-sharing operations depends on rebalancing algorithms. Earlier methods in the literature suggest a trend toward nonmyopic algorithms using queueing principles. We propose new policy cost function approximation. The is modeled as p-median relocation problem with minimum flow conservation and path-based charging station capacities static node-charge graph structure. NP complete, so heuristic proposed that ensures feasible solutions can be solved an online system. algorithm validated case study carshare Brooklyn, New York, demand data shared from BMW ReachNow September 2017 (262 vehicle fleet, 231 pickups per day, 303 traffic analysis zones) location (18 stations four-port capacities). reduces increase compared myopic by 38%. Other managerial insights are further discussed.